Density, forcing, and the covering problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Density, Forcing, and the Covering Problem

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X 6≥T ∅′ and X computes every K-trivial set.

متن کامل

Covering Graphs: The Covering Problem Solved

For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...

متن کامل

The Covering Problem

An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally,"understanding"is not a mathematical notion. This investigation requires therefore a concrete objective to capture this understanding. In the literature, the standard choice for this objective is the membership problem, whose aim is to find a p...

متن کامل

Dynamic Hub Covering Problem with Flexible Covering Radius

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

متن کامل

Hub Covering Location Problem Considering Queuing and Capacity Constraints

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Research Letters

سال: 2015

ISSN: 1073-2780,1945-001X

DOI: 10.4310/mrl.2015.v22.n3.a5